On inverse permutation polynomials
نویسنده
چکیده
We give an explicit formula of the inverse polynomial of a permutation polynomial of the form xrf(xs) over a finite field Fq where s | q − 1. This generalizes results in [6] where s = 1 or f = g q−1 s were considered respectively. We also apply our result to several interesting classes of permutation polynomials.
منابع مشابه
Remarks on Self-Inverse Quadratic Permutation Polynomials
Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Zm of modular integers are given. If m = 2n, necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples of monomial permutation polynomials are also provided. Mathematics Subject Classification: 12E10, 11B83
متن کاملOn Inverses for Quadratic Permutation Polynomials over Integer Rings
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute th...
متن کاملOn the inverses of some classes of permutations of finite fields
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the ...
متن کاملOn permutation polynomials EA-equivalent to the inverse function over GF(2n)
It is proved that there does not exist a linearized polynomial L(x) ∈ F2n [x] such that x−1+L(x) is a permutation on F2n when n ≥ 5, which is proposed as a conjecture in [15]. As a consequence, a permutation is EA-equivalent to the inverse function over F2n if and only if it is affine equivalent to it when n ≥ 5.
متن کاملRemarks on a family of permutation polynomials
We study a family of permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn and f : Fqn → Fq. In particular, we determine the cycle structure and the inverse of such a permutation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 15 شماره
صفحات -
تاریخ انتشار 2009